Maximum common subgraph: some upper bound and lower bound results
نویسندگان
چکیده
منابع مشابه
Maximum Balanced Subgraph Problem Parameterized above Lower Bound
We consider graphs without loops or parallel edges in which every edge is assigned + or −. Such a signed graph is balanced if its vertex set can be partitioned into parts V1 and V2 such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign − (one of the parts may be empty). It is well-known that every connected signed graph with...
متن کاملBranch-and-Bound Techniques for the Maximum Planar Subgraph Problem
We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...
متن کاملKernelization: New Upper and Lower Bound Techniques
In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems,...
متن کاملNew Upper and Lower Bound Sifting Iterations
with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...
متن کاملP-subgraph Isomorphism Computation and Upper Bound Complexity Estimation
An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2006
ISSN: 1471-2105
DOI: 10.1186/1471-2105-7-s4-s6